Fuzzy Clustering Methods with Rényi Relative Entropy and Cluster Size
نویسندگان
چکیده
منابع مشابه
Relative entropy fuzzy c-means clustering
Pattern recognition is a collection of computer techniques to classify various observations into different clusters of similar attributes in either supervised or unsupervised manner. Application of fuzzy logic to unsupervised classification or clustering methods has resulted in many wildly used techniques such as fuzzy c-means (FCM) method. However, when the observations are too noisy, the perf...
متن کاملMonotonicity of a relative Rényi entropy
We show that a recent definition of relative Rényi entropy is monotone under completely positive, trace preserving maps. This proves a recent conjecture of Müller–Lennert et al. Recently, Müller–Lennert et al. [12] and Wilde et al. [15] modified the traditional notion of relative Rényi entropy and showed that their new definition has several desirable properties of a relative entropy. One of th...
متن کاملRényi squashed entanglement, discord, and relative entropy differences
The squashed entanglement quantifies the amount of entanglement in a bipartite quantum state, and it satisfies all of the axioms desired for an entanglement measure. The quantum discord is a measure of quantum correlations that are different from those due to entanglement. What these two measures have in common is that they are both based upon the conditional quantum mutual information. In [Ber...
متن کاملClustering of Fuzzy Data Sets Based on Particle Swarm Optimization With Fuzzy Cluster Centers
In current study, a particle swarm clustering method is suggested for clustering triangular fuzzy data. This clustering method can find fuzzy cluster centers in the proposed method, where fuzzy cluster centers contain more points from the corresponding cluster, the higher clustering accuracy. Also, triangular fuzzy numbers are utilized to demonstrate uncertain data. To compare triangular fuzzy ...
متن کاملSmooth Entropy and Rényi Entropy
The notion of smooth entropy allows a unifying, generalized formulation of privacy ampli-cation and entropy smoothing. Smooth entropy is a measure for the number of almost uniform random bits that can be extracted from a random source by probabilistic algorithms. It is known that the R enyi entropy of order at least 2 of a random variable is a lower bound for its smooth entropy. On the other ha...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematics
سال: 2021
ISSN: 2227-7390
DOI: 10.3390/math9121423